An ahead pipelined alloyed perceptron with single cycle access time

نویسندگان

  • David Tarjan
  • Kevin Skadron
  • Mircea Stan
چکیده

The increasing pipeline depth, aggressive clock rates and execution width of modern processors require ever more accurate dynamic branch predictors to fully exploit their potential. Recent research on ahead pipelined branch predictors [11, 19] and branch predictors based on perceptrons [10, 11] have offered either increased accuracy or effective single cycle access times, at the cost of large hardware budgets and additional complexity in the branch predictor recovery mechanism. Here we show that a pipelined perceptron predictor can be constructed so that it has an effective latency of one cycle with a minimal loss of accuracy. We then introduce the concept of a precomputed local perceptron, which allows the use of both local and global history in an ahead pipelined perceptron. Both of these two techniques together allow this new perceptron predictor to match or exceed the accuracy of previous designs except at very small hardware budgets, and allow the elimination of most of the complexity in the rest of the pipeline associated with overriding predictors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Revisiting the Perceptron Predictor

The perceptron branch predictor has been recently proposed by Jiménez and Lin as an alternative to conventional branch predictors. In this paper, we build upon this original proposal in three directions. First, we show that the potential accuracy that can be achieved by perceptron-like predictors was largely underestimated. The accuracy of the redundant history skewed perceptron predictor (RHSP...

متن کامل

Revisiting the Perceptron Predictor Again

We introduce a new kind of branch predictor, the hashed perceptron predictor, which merges the concepts behind the gshare and perceptron branch predictors. This is done by fetching the perceptron weights using the exclusive-or of branch addresses and branch history. This predictor can achieve superior accuracy to a path-based and a global perceptron predictor, previously the most accurate fully...

متن کامل

2FAR: A 2bcgskew Predictor Fused by an Alloyed Redundant History Skewed Perceptron Branch Predictor

This paper describes the 2bcgskew branch predictor fused by an alloyed redundant history skewed perceptron predictor, which is our design submitted to the 1st JILP Championship Branch Prediction (CBP) competition. The presented predictor intelligently combines multiple predictions (fusion) in order to obtain a more accurate prediction. The various predictions are delivered by a 2bcgskew predict...

متن کامل

FPGA implementation of a Cache Controller with Configurable Scratchpad Space

Chip Multiprocessors (CMP) are the dominant architectural approach since the middle of this decade. They integrate multiple processing cores on a single chip. It is desirable for future CMP’s to support both implicit and explicit communication. Implicit communication occurs when we do not know in advance which input data will be needed, or who last modified them; caches and coherence work well ...

متن کامل

Pipelined adaptive IIR filter architectures using scattered and relaxed look-ahead transformations

Fine-grain pipelined architectures for adaptive infinite impulse response (AIIR) filters are presented in this paper. The AIIR filters are equation error based. The proposed architectures are developed by employing a combination of scattered look-ahead and relaxed look-ahead pipelining techniques. First, a pipelined system identification scenario is developed. Then, the scattered look-ahead tec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004